Multi-step extragradient method with regularization for triple hierarchical variational inequalities with variational inclusion and split feasibility constraints
نویسندگان
چکیده
منابع مشابه
Multistep Hybrid Extragradient Method for Triple Hierarchical Variational Inequalities
and Applied Analysis 3 where A n = α n I + A for all n ≥ 0. In particular, if V ≡ 0, then (11) reduces to the following iterative scheme: x 0 = x ∈ C chosen arbitrarily, y n = P C (x n − ] n A n x n ) , z n = β n x n + γ n P C (x n − ] n A n y n ) + σ n TP C (x n − ] n A n y n ) , x n+1 = P C [λ n (1 − δ n ) γSx n + (I − λ n μF) z n ] , ∀n ≥ 0. (12) Further, if S = V, then (11) reduces to the f...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملMathematical programming with multiple sets split monotone variational inclusion constraints
In this paper, we first study a hierarchical problem of Baillon’s type, and we study a strong convergence theorem of this problem. For the special case of this convergence theorem, we obtain a strong convergence theorem for the ergodic theorem of Baillon’s type. Our result of the ergodic theorem of Baillon’s type improves and generalizes many existence theorems of this type of problem. Two nume...
متن کاملThe Mann-Type Extragradient Iterative Algorithms with Regularization for Solving Variational Inequality Problems, Split Feasibility, and Fixed Point Problems
and Applied Analysis 3 open topic. For example, it is yet not clear whether the dual approach to (7) of [29] can be extended to the SFP. The original algorithm given in [15] involves the computation of the inverse A (assuming the existence of the inverse of A), and thus has not become popular. A seemingly more popular algorithm that solves the SFP is the CQ algorithm of Byrne [16, 21] which is ...
متن کاملIteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
In a recent paper by Monteiro and Svaiter, a hybrid proximal extragradient (HPE) framework was used to study the iteration-complexity of a first-order (or, in the context of optimization, second-order) method for solving monotone nonlinear equations. The purpose of this paper is to extend this analysis to study a prox-type first-order method for monotone smooth variational inequalities and incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2014
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2014-492